Unconstrained binary models of the travelling salesman problem variants for quantum optimization

Abstract Quantum computing is offering a novel perspective for solving combinatorial optimization problems. To fully explore the possibilities offered by quantum computers, problems need to be formulated as unconstrained binary models, taking into account limitation and advantages of devices. In this work, we provide detailed analysis travelling salesman problem with time windows (TSPTW) in context it on computer. We introduce quadratic higher-order formulations problem. demonstrate edge-based node-based TSPTW Additionally, investigate experimental realization presented methods annealing device. The provided results pave path utilizing computer variety real-world tasks which can cast form windows.